Hack-proof synchronization protocol for multi-player online games
نویسندگان
چکیده
منابع مشابه
P2P Middleware for Massively Multi-player Online Games
The Peer-to-Peer (P2P) computing paradigm is currently receiving considerable attention. Many recent research advances are enabling P2P systems to be used for complex applications, beyond simple file sharing. We are currently focusing on Massively Multi-player Online Gaming (MMOG) applications. A P2P architecture offers several advantages over centralized architectures for various applications,...
متن کاملRepairing Multi-Player Games
Synthesis is the automated construction of systems from their specifications. Modern systems often consist of interacting components, each having its own objective. The interaction among the components is modeled by a multi-player game. Strategies of the components induce a trace in the game, and the objective of each component is to force the game into a trace that satisfies its specification....
متن کاملMastering multi-player games
We consider multi-player games, and the guarantees that a master player that plays on behalf of a set of players can offer them, without making any assumptions on the rationality of the other players. Our model consists of an (n + 1)-player game, with m strategies per player, in which a master player M forms a coalition with nontransferable utilities among n players, and the remaining player is...
متن کاملOn Pruning Techniques for Multi-Player Games
Max (Luckhardt and Irani, 1986) is the extension of the minimax backup rule to multi-player games. We have shown that only a limited version of alpha-beta pruning, shallow pruning, can be applied to a max search tree. We extend this work by calculating the exact bounds needed to use this pruning technique. In addition, we show that branch-and-bound pruning, using a monotonic heuristic, has the ...
متن کاملConcurrent Multi-Player Parity Games
Parity games are a powerful framework widely used to address fundamental questions in computer science. In the basic setting they consist of two-player turn-based games, played on directed graphs, whose nodes are labeled with priorities. Solving such a game can be done in time exponential in the number of the priorities (and polynomial in the number of states) and it is a long-standing open que...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Multimedia Tools and Applications
سال: 2008
ISSN: 1380-7501,1573-7721
DOI: 10.1007/s11042-008-0230-3